The Computational Difficulty of Manipulating an Election *
نویسنده
چکیده
We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategic manipulation. It is NP-complete for a manipulative voter to determine how to exploit knowledge of the preferences of others. In contrast, many standard voting schemes can be manipulated with only polynomial computational effort.
منابع مشابه
Increasing the Performance of OFDM Systems by PAPR Reduction in PTS Technique using Election Optimization Algorithm
Orthogonal Frequency Division Multiplexing (OFDM) is a useful technology in wireless communications that provides high-rate data transmission in multipath fading channels. The advantages of OFDM systems are the high spectral efficiency and strong resistance to frequency selective fading. In OFDM systems, a large number of sub-carriers are used to modulate the symbols causing the time-domain OFD...
متن کاملAlgorithmic aspects of manipulation and anonymization in social choice and social networks
This thesis presents a study of several combinatorial problems related to social choice and social networks. The main concern is their computational complexity, with an emphasis on their parameterized complexity. The goal is to devise efficient algorithms for each of the problems studied here, or to prove that, under widely-accepted assumptions, such algorithms cannot exist. The problems discus...
متن کاملSolving election manipulation using integer partitioning problems
An interesting problem of multi-agent systems is that of voting, in which the preferences of autonomous agents are to be combined. Applications of voting include modeling social structures, search engine ranking, and choosing a leader among computational agents. In the setting of voting, it is very important that each agent presents truthful information about his or her preferences, and not man...
متن کاملThe Complexity of Manipulating k-Approval Elections
An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems. These kinds of voting strategies are often tempting at the individual level but disastrous for the agents as a whole. Creating election systems where the determination of such strategies is difficult is thus an importa...
متن کاملThe Effects of Task Complexity on English Language Learners’ Listening Comprehension
This article reports on the findings of a study that investigated the impact of manipulating task performance conditions on listening task performance by learners of English as a foreign language (EFL). The study was designed to explore the effects of changing complexity dimensions on listening task performance and to achieve two aims: to see how listening comprehension task performance was aff...
متن کامل